Image encryption based on elliptic curve cryptosystem

نویسندگان

چکیده

Image encryption based on elliptic curve cryptosystem and reducing its complexity is still being actively researched. Generating matrix for algorithm secret key together with Hilbert will be involved in this study. For a first case we need not to compute the inverse decryption processing cause that generated step was self invertible matrix. While second case, computing required. Peak signal noise ratio (PSNR), unified average changing intensity (UACI) used assess which more efficiency grayscale image.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Threshold Authenticated Encryption Scheme Based on Elliptic Curve Cryptosystem

A (t,n) threshold authenticated encryption scheme allows more than t signers to generate an authenticated cipher-text for a message and only the designated verifier can verify the message. Recently, Chung et al. [1] proposed a (t, n) threshold authenticated encryption scheme by applying a division-of-labor signature technique. However, we showed that the scheme has a design flaw. Then, we propo...

متن کامل

Nonce Based Elliptic Curve Cryptosystem for Text and Image Applications

With the explosion of networks and the huge amount of data transmitted along, securing data content is becoming more and more important. Data encryption is widely used to ensure security in open networks such as the Internet. With the fast development of cryptography research and computer technology, the capabilities of cryptosystems such as of RSA and Diffie-Hellman are inadequate due to the r...

متن کامل

The Elliptic Curve Cryptosystem

The Elliptic Curve Cryptosystem (ECC) provides the highest strength-per-bit of any cryptosystem known today. This paper provides an overview of the three hard mathematical problems which provide the basis for the security of publickey cryptosystems used today: the integer factorization problem (IFP), the discrete logarithm problem (DLP), and the elliptic curve discrete logarithm problem (ECDLP)...

متن کامل

An efficient semantically secure elliptic curve cryptosystem based on KMOV

We propose an elliptic curve scheme over the ring Zn2 , which is efficient and semantically secure in the standard model. There appears to be no previous elliptic curve cryptosystem based on factoring that enjoys both of these properties. The KMOV scheme has been used as an underlying primitive to obtain efficiency and probabilistic encryption. Semantic security of the scheme is based on a new ...

متن کامل

An MSS Based on the Elliptic Curve Cryptosystem

In 2004, a multi-signature scheme (MSS) based on the elliptic curve cryptosystem is given by Chen et al. [1]. Later, Liu and Liu [6] showed that if one of the users always sends his data in the last during each steps of the key generation and multi-signature generation phase then MSS becomes insecure. In this paper we propose a scheme which prevents the system from such insecurity. Also, in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Power Electronics and Drive Systems

سال: 2021

ISSN: ['2722-2578', '2722-256X']

DOI: https://doi.org/10.11591/ijece.v11i2.pp1293-1302